FPGA Placement and Routing Algorithm: A Survey
ثبت نشده
چکیده
Unlike ASICs, FPGAs have routing fabrics that are pre-manufactured. And because of this prefabrication, FPGAs hardly can achieve high clock frequencies which offered by ASICs. Thus, there is a need for better FPGA timing performance. And design automation or computer-aided design (CAD) tools for field programmable gate arrays (FPGAs) have played a very critical role over the past decades for FPGA design. This mini survey presents the up-to-date overview of placement and routing algorithm for FPGA devices with an emphasis on the recent research from 2008.
منابع مشابه
Discrete Multi Objective Particle Swarm Optimization Algorithm for FPGA Placement (RESEARCH NOTE)
Placement process is one of the vital stages in physical design. In this stage, modules and elements of circuit are placed in distinct locations according to optimization basis. So that, each placement process tries to influence on one or more optimization factor. In the other hand, it can be told unequivocally that FPGA is one of the most important and applicable devices in our electronic worl...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملPlacement and Placement Driven Technology Mapping for FPGA Synthesis
Because of the more restrictive placement and routing constraints in Xilinx FPGA designs, conventional physical design tools for general placement and routing architectures usually do not work well for FPGA designs. Moreover, to generate high quality circuits which are easy to place and route, it is important to consider the specific physical design constraints during the technology mapping pro...
متن کاملGenetic Algorithm for FPGA Placement
Field-Programmable Gate Arrays (FPGAs) are flexible circuits that can be (re)configured by the designer. The efficient use of these circuits requires complex CAD tools. One of the steps of the design process for FPGAs is represented by placement. In this paper we present a genetic algorithm for the FPGA placement problem, in particular for the Atmel FPGA circuits. Because of the limited routing...
متن کاملAdaptive Algorithm for Routing and Placement in Fpga
The design of the placement and routing for an FPGA (whether it’s a traditional or coarse grained field programmable gate arrays) is very important process, requiring the care about the flexibility with silicon efficiency. With the motivation growing towards embedding FPGAs into SoC (system on chip) designs, final requirements for the FPGA architectures becomes more critical. The identification...
متن کامل